On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
نویسندگان
چکیده
منابع مشابه
cellular behavior and scanning electron microscope evaluation of pro-root mta, root mta and modified mta on fibroblast l929
چکیده ندارد.
15 صفحه اولQuartets and Unrooted phylogenetic Networks
Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as a special kind of abstract network to visualize conflicts between phylogenetic trees which may correspond to such exchanges. More recently, methods were designed to reconstruct explicit phylogeneti...
متن کاملTree-Based Unrooted Phylogenetic Networks
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is...
متن کاملUNROOTED SUPERTREES Limitations, traps, and phylogenetic patchworks
Whereas biologists might think of rooted trees as the natural, or even the only, way to display phylogenetic relationships, this is not the case for a mathematician, to whom rooted and unrooted trees are graph-theoretical constructions that can be transformed easily into one another. An unrooted tree contains the same information as its rooted counterpart with the single exception that it does ...
متن کاملCompatibility of unrooted phylogenetic trees is FPT
A collection of T1, T2, . . . , Tk of unrooted, leaf labelled (phylogenetic) trees, all with different leaf sets, is said to be compatible if there exists a tree T such that each tree Ti can be obtained from T by deleting leaves and contracting edges. Determining compatibility is NP-hard, and the fastest algorithm to date has worst case complexity of around (nk) time, n being the number of leav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0366-5